package 因子分解和枚举.好因子的最大数目;

/**
 * TODO
 *
 * @className: hyzdzdsm
 * @description: TODO
 * @author: 等什么柠檬君
 * @date: 2022-05-07 09:26
 **/
public class hyzdzdsm {
    /**
     * 没做出来
     * @param args
     */
    public static void main(String[] args) {
        System.out.println(maxNiceDivisors(5));
    }
    static int mod = (int) 1e9;
    public static int maxNiceDivisors(int primeFactors) {

       return (int) (getJC(mod)/getJC((mod-primeFactors)));
//        A 5 10^9
    }

    public static long getJC(int n){
        long result = 1;
        for (int i = 1; i <= n; ++i) {
            result *= i;
            result %= mod;
        }
        return result % mod;
    }

}
